Computational Complexity and Knowledge Complexity
نویسندگان
چکیده
We study the computational complexity of languages which have interactive proofs of logarithmic knowledge complexity. We show that all such languages can be recognized in BPPNP . Prior to this work, for languages with greater-than-zero knowledge complexity only trivial computational complexity bounds were known. In the course of our proof, we relate statistical knowledge complexity to perfect knowledge complexity; specifically, we show that, for the honest verifier, these hierarchies coincide up to a logarithmic additive term.
منابع مشابه
Reduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملThe effect of language complexity and group size on knowledge construction: Implications for online learning
This study investigated the effect of language complexity and group size on knowledge construction in two online debates. Knowledge construction was assessed using Gunawardena et al.’s Interaction Analysis Model (1997). Language complexity was determined by dividing the number of unique words by total words. It refers to the lexical variation. The results showed that...
متن کاملUsing Complexity to Simplify Knowledge Translation; Comment on “Using Complexity and Network Concepts to Inform Healthcare Knowledge Translation”
Putting health theories, research and knowledge into practice is a challenge referred to as the knowledge-toaction gap. Knowledge translation (KT), and its related concepts of knowledge mobilization, implementation science and research impact, emerged to mitigate this gap. While the social interaction view of KT has gained currency, scholars have not easily made a link between KT and the concep...
متن کاملAdaptive Subcarrier Assignment and Power Distribution in Multiuser OFDM Systems with Proportional Data Rate Requirement
A low complexity dynamic subcarrier and power allocation methodology for downlink communication in an OFDM-based multiuser environment is developed. The problem of maximizing overall capacity with constraints on total power consumption, bit error rate and data rate proportionality among users requiring different QOS specifications is formulated. Assuming perfect knowledge of the instantaneo...
متن کاملBiclique Cryptanalysis of Block Ciphers LBlock and TWINE-80 with Practical Data Complexity
In the biclique attack, a shorter biclique usually results in less data complexity, but at the expense of more computational complexity. The early abort technique can be used in partial matching part of the biclique attack in order to slightly reduce the computations. In this paper, we make use of this technique, but instead of slight improvement in the computational complexity, we keep the amo...
متن کاملApplying KT Network Complexity to a Highly-Partnered Knowledge Transfer Effort; Comment on “Using Complexity and Network Concepts to Inform Healthcare Knowledge Translation”
The re-conceptualization of knowledge translation (KT) in Kitson and colleagues’ manuscript “Using Complexity and Network Concepts to Inform Healthcare Knowledge Translation” is an advancement in how one can incorporate implementation into the KT process. Kitson notes that “the challenge is to explain how it might help in the healthcare policy, practice, and research communities.” We propose th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 1 شماره
صفحات -
تاریخ انتشار 1994